Graph clustering via generalized colorings

We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense parts graph, we concentrate on structure edges between clusters, as it is motivated by some earlier observations, e.g. networks ecology economics applications discrete tomography. Mathematically special colorings chromatic numbers are studied.